On Word and Frontier Languages of Unsafe Higher-Order Grammars
نویسندگان
چکیده
Higher-order grammars are an extension of regular and context-free grammars, where nonterminals may take parameters. They have been extensively studied in 1980’s, and restudied recently in the context of model checking and program verification. We show that the class of unsafe order-(n+1) word languages coincides with the class of frontier languages of unsafe order-n tree languages. We use intersection types for transforming an order-(n+1) word grammar to a corresponding order-n tree grammar. The result has been proved for safe languages by Damm in 1982, but it has been open for unsafe languages, to our knowledge. Various known results on higher-order grammars can be obtained as almost immediate corollaries of our result. 1998 ACM Subject Classification F.4.3 Formal Languages
منابع مشابه
Unsafe Order-2 Tree Languages Are Context-Sensitive
Higher-order grammars have been extensively studied in 1980’s and interests in them have revived recently in the context of higher-order model checking and program verification, where higher-order grammars are used as models of higher-order functional programs. A lot of theoretical questions remain open, however, for unsafe higher-order grammars (grammars without the so-called safety condition)...
متن کاملPumping Lemma for Higher-order Languages
We study a pumping lemma for the word/tree languages generated by higher-order grammars. Pumping lemmas are known up to order-2 word languages (i.e., for regular/context-free/indexed languages), and have been used to show that a given language does not belong to the classes of regular/context-free/indexed languages. We prove a pumping lemma for word/tree languages of arbitrary orders, modulo a ...
متن کاملDevelopmental Constraints on Learning Artificial Grammars with Fixed, Flexible and Free Word Order
Human learning, although highly flexible and efficient, is constrained in ways that facilitate or impede the acquisition of certain systems of information. Some such constraints, active during infancy and childhood, have been proposed to account for the apparent ease with which typically developing children acquire language. In a series of experiments, we investigated the role of developmental ...
متن کاملC Ompetence and P Erformance M Odelling of F Ree
The course surveys competence and performance issues relating to modelling grammars of free word order languages. Regarding competence issues, we focus on two fundamental issues: adjacency (unbounded dependencies, crossed and nested dependencies), and the power required of the formal apparatus used to explain free word order. In this context, we survey various approaches to modelling free word ...
متن کاملTopological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these grammars contain two primitive notions of constituency that are used to preserve the semantic or interpretational aspects of phrase structure, while at the same time providing a more efficient backbone for parsing based on...
متن کامل